Low-Complexity Tree-Based Iterative Decoding for Coded SCMA
نویسندگان
چکیده
منابع مشابه
Low-complexity iterative decoding for coded differential transmission
In this paper, a power-efficient low-complexity iterative receiver structure for noncoherent transmission over Rayleigh flat fading channels without channel state information (CSI) is presented. As the main contribution, several novel decision-feedback assisted differential demodulators are derived, which are well suited to implementation. Thereby, the general case of multiple transmit and mult...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملReduced - Complexity Coded Gmsk Systems Using Iterative Decoding
In this thesis, a number of coded Gaussian minimum-shift keying (GMSK) transceiver systems using the Laurent representation and iterative decoding are proposcd and evaluated. First, a Cstate reduced-complexity linear demodulator is shown to perfom close to the optimal 16-state demodulator for BT=0.3. This reduced-complexity receiver is used with a coded GMSK system, and a mode1 for considering ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملA Low Complexity Detection Algorithm for SCMA
Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal resources and thus meets the requirement of the fifth generation (5G) wireless networks. However, the computation complexity of existing detection algorithms increas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communication and Information Systems
سال: 2020
ISSN: 1980-6604,1980-6604
DOI: 10.14209/jcis.2020.19